Memory Requirements for Query Execution in Highly Constrained Devices
نویسندگان
چکیده
Pervasive computing introduces data management requirements that must be tackled in a growing variety of lightweight computing devices. Personal folders on chip, networks of sensors and data hosted by autonomous mobile computers are different illustrations of the need for evaluating queries confined in hardware constrained computing devices. RAM is the most limiting factor in this context. This paper gives a thorough analysis of the RAM consumption problem and makes the following contributions. First, it proposes a query execution model that reaches a lower bound in terms of RAM consumption. Second, it devises a new form of optimization, called iteration filter, that drastically reduces the prohibitive cost incurred by the preceding model, without hurting the RAM lower bound. Third, it analyses how the preceding techniques can benefit from an incremental growth of RAM. This work paves the way for setting up co-design rules helping to calibrate the RAM resource of a hardware platform according to given application’s requirements as well as to adapt an application to an existing hardware platform. To the best of our knowledge, this work is the first attempt to devise co-design rules for data centric embedded applications. We illustrate the effectiveness of our techniques through a performance evaluation.
منابع مشابه
On Finding a Memory Lower Bound for Query Evaluation in Lightweight Devices
Pervasive computing introduces data management requirements that must be tackled in a growing variety of lightweight computing devices. Personal folders on chip (e.g., healthcare folders on smartcards), networks of sensors (e.g., pollution sensors) and data hosted by autonomous mobile computers (e.g., tourist information downloaded on a car computer) are different illustrations of the need for ...
متن کاملComplex Queries in P2P Networks with Resource-Constrained Devices
Structured Peer-to-Peer (P2P) systems are increasingly important for scalable data dissemination and search. At the same time, the importance of mobile devices like smartphones, PDAs, and netbooks for accessing and storing data is rapidly increasing. Current distributed approaches for resolving complex search queries, like multi-attribute and range queries, typically require multiple messages t...
متن کاملPrediction of Number of Zombies in a DDoS Attack using Polynomial Regression Model
Structured Peer-to-Peer (P2P) systems are increasingly important for scalable data dissemination and search. At the same time, the importance of mobile devices like smartphones, PDAs, and netbooks for accessing and storing data is rapidly increasing. Current distributed approaches for resolving complex search queries, like multi-attribute and range queries, typically require multiple messages t...
متن کاملSingle Query Optimization for Tertiary Memory
We present query execution strategies that are optimized for the characteristics of tertiary memory devices. Traditional query execution methods are oriented to magnetic disk or main memory and perform poorly on tertiary memory. Our methods use ordering and batching techniques on the I/O requests to reduce the media switch cost and seek cost on these devices. Some of our methods are provably op...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کامل